home *** CD-ROM | disk | FTP | other *** search
- Path: dnaco.net!root
- From: renegade@dnaco.net (Renegade)
- Newsgroups: comp.networks,comp.os.linux.networking,comp.os.ms-windows.networking,comp.os.ms-windows.programmer.networks,comp.lang.c,comp.lang.c++
- Subject: Help: CRC calculation for arbitrary generator polynomial
- Date: Fri, 23 Feb 1996 16:03:00 GMT
- Organization: The Dayton Network Access Company (DNACo)
- Message-ID: <4gke26$57k@sisko.dnaco.net>
- Reply-To: renegade@dnaco.net
- NNTP-Posting-Host: @odo.dnaco.net
- X-Newsreader: Forte Free Agent 1.0.82
-
- Greetings,
-
- I am trying to do some simulations on CRC codes. I have found several
- sources that have code for generating CRC's. The only problem is that
- these algorithms are based on 16 or 32 bit CRC's and table lookups. I
- would like to be able to use a 4 or 8 bit CRC. I have not
- been able to successfully figure out how to convert these algorithms
- to an arbitrary length CRC. The tables (XOR's with the generator and
- all possible one byte data characters) are used for efficiency. I'm
- not so concerned about speed. I just want to be able to change the
- CRC generator polynomial. I can run my simualtions overnight so the
- time wasted using bit shifts to compute the CRC the way hardware does
- is ok.
-
- If you can help please e-mail me at RENEGADE@DNACO.NET
-
- If anyone using Linux is interested in scripts to connect to the
- Internet via PPP also let me know. I have developed perl
- scripts to make a PPP connection to the Internet. These
- scripts will re-dial if the line is busy, and can handle dynamic IP
- addressing.
-
- Thanks in advance,
- Dave Hoeferlin
- Renegade@dnaco.net
-
-
-